combinatorial genus

См. также в других словарях:

• Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… …   Wikipedia

• Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… …   Wikipedia

• Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

• Spider bite — redirects here. For The Spider Bite urban legend, see The Spider Bite. Spider bite Classification and external resources Chelicerae of a black wishbone (nemesiid) spider, a mygalomorph …   Wikipedia

• pharmaceutical industry — Producers of pharmaceuticals, substances used in the diagnosis, treatment, and prevention of disease and the modification of organic functions. The earliest records of medicinal plants and minerals are those of the ancient Chinese, Hindu, and… …   Universalium

• Dehn function — In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation which bounds the area of a relation in that group (that is a freely reduced word in the …   Wikipedia

• Dessin d'enfant — In mathematics, a dessin d enfant (French for a child s drawing , plural dessins d enfants, children s drawings ) is a type of graph drawing used to study Riemann surfaces and to provide combinatorial invariants for the action of the absolute… …   Wikipedia

• Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

• Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three …   Wikipedia

• Manifold — For other uses, see Manifold (disambiguation). The sphere (surface of a ball) is a two dimensional manifold since it can be represented by a collection of two dimensional maps. In mathematics (specifically in differential geometry and topology),… …   Wikipedia

• Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 …   Wikipedia